منابع مشابه
A A PSPACE-Complete First Order Fragment of Computability Logic
Computability Logic (CoL), introduced by Japaridze in [2003; 2009a], is a research program for developing logic as a formal theory of interactive computability. Formulas in it are understood as (interactive) computational problems and logical operators represent operations on such entities. The goal of this program is to define a systematic way to answer the question “what can be computed?” wit...
متن کاملAbstract correction of first-order functional programs
Correction of First-Order Functional Programs M. Alpuente a D. Ballis b S. Escobar a M. Falaschi b S. Lucas a a DSIC, Universidad Politécnica de Valencia, Camino de Vera s/n, Apdo. 22012, 46071 Valencia, Spain. Email: {alpuente,sescobar,slucas}@dsic.upv.es. b Dip. Matematica e Informatica, Via delle Scienze 206, 33100 Udine, Italy. Email: {demis,falaschi}@dimi.uniud.it.
متن کاملIntuitionistic computability logic I
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and “truth” is understood as algorithmic solvability, CL potentially offers a comprehensive logical b...
متن کاملAbstract Computability, Algebraic Specification and Initiality
Computability and Algebraic Specifications Abstract Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all absract computable functions on any many-sorted algebra; and (ii) all functions effectively approximable by abstract ...
متن کاملGeneralizing Computability Theory to Abstract Algebras
We present a survey of our work over the last few decades on generalizations of computability theory to many-sorted algebras. The following topics are discussed, among others: (1) abstract v concrete models of computation for such algebras; (2) computability and continuity, and the use of many-sorted topological partial algebras, containing the reals; (3) comparisons between various equivalent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1969
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1969-0244045-0